TSTP Solution File: NUM793^1 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : NUM793^1 : TPTP v8.1.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 13:56:42 EDT 2022
% Result : Theorem 0.19s 0.37s
% Output : Proof 0.19s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
thf(ty_rat,type,
rat: $tType ).
thf(ty_moreis,type,
moreis: rat > rat > $o ).
thf(ty_z0,type,
z0: rat ).
thf(ty_less,type,
less: rat > rat > $o ).
thf(ty_x0,type,
x0: rat ).
thf(ty_lessis,type,
lessis: rat > rat > $o ).
thf(ty_y0,type,
y0: rat ).
thf(ty_more,type,
more: rat > rat > $o ).
thf(sP1,plain,
( sP1
<=> ! [X1: rat,X2: rat] :
( ( more @ X1 @ X2 )
=> ( less @ X2 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ! [X1: rat,X2: rat] :
( ( lessis @ z0 @ X1 )
=> ( ( less @ X1 @ X2 )
=> ( less @ z0 @ X2 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ( more @ x0 @ y0 ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ! [X1: rat] :
( ( less @ z0 @ X1 )
=> ( more @ X1 @ z0 ) ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ! [X1: rat,X2: rat] :
( ( less @ X1 @ X2 )
=> ( more @ X2 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ( moreis @ y0 @ z0 ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ( ( less @ y0 @ x0 )
=> ( less @ z0 @ x0 ) ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ! [X1: rat] :
( ( lessis @ z0 @ y0 )
=> ( ( less @ y0 @ X1 )
=> ( less @ z0 @ X1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ( lessis @ z0 @ y0 ) ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ( ( less @ z0 @ x0 )
=> ( more @ x0 @ z0 ) ) ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(sP11,plain,
( sP11
<=> ( sP3
=> ( less @ y0 @ x0 ) ) ),
introduced(definition,[new_symbols(definition,[sP11])]) ).
thf(sP12,plain,
( sP12
<=> ( less @ y0 @ x0 ) ),
introduced(definition,[new_symbols(definition,[sP12])]) ).
thf(sP13,plain,
( sP13
<=> ! [X1: rat,X2: rat] :
( ( moreis @ X1 @ X2 )
=> ( lessis @ X2 @ X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP13])]) ).
thf(sP14,plain,
( sP14
<=> ( more @ x0 @ z0 ) ),
introduced(definition,[new_symbols(definition,[sP14])]) ).
thf(sP15,plain,
( sP15
<=> ( less @ z0 @ x0 ) ),
introduced(definition,[new_symbols(definition,[sP15])]) ).
thf(sP16,plain,
( sP16
<=> ! [X1: rat] :
( ( more @ x0 @ X1 )
=> ( less @ X1 @ x0 ) ) ),
introduced(definition,[new_symbols(definition,[sP16])]) ).
thf(sP17,plain,
( sP17
<=> ! [X1: rat] :
( ( moreis @ y0 @ X1 )
=> ( lessis @ X1 @ y0 ) ) ),
introduced(definition,[new_symbols(definition,[sP17])]) ).
thf(sP18,plain,
( sP18
<=> ( sP6
=> sP9 ) ),
introduced(definition,[new_symbols(definition,[sP18])]) ).
thf(sP19,plain,
( sP19
<=> ! [X1: rat,X2: rat,X3: rat] :
( ( lessis @ X1 @ X2 )
=> ( ( less @ X2 @ X3 )
=> ( less @ X1 @ X3 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP19])]) ).
thf(sP20,plain,
( sP20
<=> ( sP9
=> sP7 ) ),
introduced(definition,[new_symbols(definition,[sP20])]) ).
thf(satz87d,conjecture,
sP14 ).
thf(h0,negated_conjecture,
~ sP14,
inference(assume_negation,[status(cth)],[satz87d]) ).
thf(1,plain,
( ~ sP16
| sP11 ),
inference(all_rule,[status(thm)],]) ).
thf(2,plain,
( ~ sP11
| ~ sP3
| sP12 ),
inference(prop_rule,[status(thm)],]) ).
thf(3,plain,
( ~ sP19
| sP2 ),
inference(all_rule,[status(thm)],]) ).
thf(4,plain,
( ~ sP2
| sP8 ),
inference(all_rule,[status(thm)],]) ).
thf(5,plain,
( ~ sP8
| sP20 ),
inference(all_rule,[status(thm)],]) ).
thf(6,plain,
( ~ sP20
| ~ sP9
| sP7 ),
inference(prop_rule,[status(thm)],]) ).
thf(7,plain,
( ~ sP7
| ~ sP12
| sP15 ),
inference(prop_rule,[status(thm)],]) ).
thf(8,plain,
( ~ sP13
| sP17 ),
inference(all_rule,[status(thm)],]) ).
thf(9,plain,
( ~ sP17
| sP18 ),
inference(all_rule,[status(thm)],]) ).
thf(10,plain,
( ~ sP18
| ~ sP6
| sP9 ),
inference(prop_rule,[status(thm)],]) ).
thf(11,plain,
( ~ sP1
| sP16 ),
inference(all_rule,[status(thm)],]) ).
thf(12,plain,
( ~ sP5
| sP4 ),
inference(all_rule,[status(thm)],]) ).
thf(13,plain,
( ~ sP4
| sP10 ),
inference(all_rule,[status(thm)],]) ).
thf(14,plain,
( ~ sP10
| ~ sP15
| sP14 ),
inference(prop_rule,[status(thm)],]) ).
thf(m,axiom,
sP3 ).
thf(n,axiom,
sP6 ).
thf(satz83,axiom,
sP5 ).
thf(satz87a,axiom,
sP19 ).
thf(satz84,axiom,
sP13 ).
thf(satz82,axiom,
sP1 ).
thf(15,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h0])],[1,2,3,4,5,6,7,8,9,10,11,12,13,14,m,n,satz83,satz87a,satz84,satz82,h0]) ).
thf(0,theorem,
sP14,
inference(contra,[status(thm),contra(discharge,[h0])],[15,h0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM793^1 : TPTP v8.1.0. Released v3.7.0.
% 0.03/0.13 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jul 7 09:37:59 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.37 % SZS status Theorem
% 0.19/0.37 % Mode: mode213
% 0.19/0.37 % Inferences: 14
% 0.19/0.37 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------